Modification of picture parameter set (pps) for hevc extensions

ABSTRACT

A method, apparatus, article of manufacture, and a memory structure for signaling extension functions used in decoding a sequence comprising a plurality of pictures, each picture processed at least in part according to a picture parameter set is disclosed. In one embodiment, the method comprises reading a first extension flag signaling a first extension function in the processing of the sequence and determining if the first extension flag has a first value. Further, the method reads a second extension flag signaling a second extension function in the processing of the sequence and performs the second extension function according to the read second extension flag only if the first extension flag has a first value.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.17/110,069, filed Dec. 2, 2020, which is a continuation of U.S. patentapplication Ser. No. 14/533,386, filed Nov. 5, 2014, which claimsbenefit of U.S. Provisional Patent Application, which is herebyincorporated by reference: Application Ser. No. 61/900,906, entitled“THE MODIFICATION OF PICTURE PARAMETER SET (PPS) FOR HEVC RANGEEXTENSION,” by Yue Yu and Limin Wang, filed Nov. 6, 2013.

BACKGROUND OF THE INVENTION 1. Field of the Invention

The present invention relates to systems and methods for encoding data,and in particular to a system and method for generating and processingslice headers with high efficiency video coded data.

2. Description of the Related Art

There is rapid growth in the technologies associated with thegeneration, transmission, and reproduction of media programs. Thesetechnologies include coding schemes that permit digital versions of themedia programs to be encoded to compress them to much smaller size andfacilitate their transmission, storage, reception, and playback. Thesetechnologies have application in personal video recorders (PVRs), videoon demand (VOD), multiple channel media program offerings,interactivity, mobile telephony, and media program transmission.

Without compression, digital media programs are typically too large totransmit and/or store for a commercially acceptable cost. However,compression of such programs has made the transmission and storage ofsuch digital media programs not only commercially feasible, butcommonplace.

Initially, the transmission of media programs involved low to mediumresolution images transmitted over high bandwidth transmission mediasuch as cable television and satellite. However, such transmission hasevolved to include lower bandwidth transmission media such as Internettransmission to fixed and mobile devices via computer networks, WiFi,Mobile TV and third and fourth generation (3G and 4G) networks. Further,such transmissions have also evolved to include high definition mediaprograms such as high definition television (HDTV), which havesignificant transmission bandwidth and storage requirements.

The High Efficiency Video Coding (HEVC) coding standard (or H.265) isthe most recent coding standard promulgated by the ISO/IEC MPEGstandardization organizations. The coding standard preceding HEVCincluded the H.262/MPEG-2 and the subsequent H.264/MPEG-4 Advanced VideoCoding (AVC) standard. H.264/MPEG-4 has substantially replacedH.262/MPEG-2 in many applications including high definition (HD)television. HEVC supports resolutions higher than HD, even in stereo ormulti-view embodiments, and is more suitable for mobile devices such astablet personal computers. Further information regarding HEVC can befound in the publication “Overview of the High Efficiency Video Coding(HEVC) Standard, by Gary J. Sullivan, Jens-Rainer Ohm, Woo Jin Han andThomas Wiegand, IEEE Transactions on Circuits and Systems for VideoTechnology, December 2012, which is hereby incorporated by referenceherein.

As in other coding standards, the bitstream structure and syntax of HEVCcompliant data are standardized, such that every decoder conforming tothe standard will produce the same output when provided with the sameinput. Some of the features incorporated into the HEVC standard includethe definition and processing of a slice, one or more of which maytogether comprise one of the pictures in a video sequence. A videosequence comprises a plurality of pictures, and each picture maycomprise one or more slices. Slices include non-dependent slices anddependent slices. A non-dependent slice (hereinafter simply referred toas a slice) is a data structure that can be decoded independently fromother slices of the same picture in terms of entropy encoding, signalprediction, and residual signal construction. This data structurepermits resynchronization of events in case of data losses. A “dependentslice” is a structure that permits information about the slice (such asthose related with tiles within the slice or wavefront entries) to becarried to the network layer, thus making that data available to asystem to more quickly process fragmented slices. Dependent slices aremostly useful for low-delay encoding.

HEVC and legacy coding standards define a parameter set structure thatoffers improved flexibility for operation over a wide variety ofapplications and network environments, and improved robustness to datalosses. Parameter sets contain information that can be shared fordecoding of different portions of the encoded video. The parameter setstructure provides a secure mechanism for conveying data that isessential to the decoding process. H.264 defined both sequence parametersets (SPS) that describe parameters for decoding a sequence of picturesand a picture parameter set (PPS) that describes parameters for decodinga picture of the sequence of pictures. HEVC introduces a new parameterset, the video parameter set (VPS).

The encoding and decoding of slices is performed according toinformation included in a slice header. The slice header includes syntaxand logic for reading flags and data that are used in decoding theslice.

Like its predecessors, HEVC supports both temporal and spatial encodingof picture slices. HEVC defines slices to include I-slices, which arespatially, but not temporally encoded with reference to another slice.I-slices are alternatively described as “intra” slice encoded. HEVC alsodefines slices to include P (predictive) slices, which are spatiallyencoded and temporally encoded with reference to another slice. P-slicesare alternatively described as “inter” slice encoded. HEVC alsodescribes slices to include bi-predictive (B)-slices. B-slices arespatially encoded and temporally encoded with reference to two or moreother slices. Further, HEVC consolidates the notion of P and B slicesinto general B slices that can be used as reference slice.

Currently, the HEVC syntax includes provision for extensions to expandthe capabilities or capacities of HEVC beyond the baseline. Suchextensions include range extensions (RExt, scalability extensions(SHVC), and multi-view extensions (MV-HEVC). Extensions may be signaledin the VPS, SPS, PPS, or combination thereof.

Currently, the PPS syntax, defines both range and multilayer extensions,as described in paragraphs 7.3.2.2.2 and 7.3.2.2.3 of “Draft highefficiency video coding (HEVC) version 2, combined format rangeextensions (RExt), scalability (SHVC), and multi-view (MV-HEVC)extensions,” Draft ISO/IEC 23008-2:201x(E) JCTVC-R1013_v6, published bythe Joint Collaborative Team on Video Coding (JCT-VC), on Jun. 30, 2014by Jill Boyce et al., which is hereby incorporated by reference herein.However, this standard provides for the handling of extension flags andextensions that are functionally independent from one another (e.g. thepresence of a particular extension does not make the presence of anotherparticular extension more probable, and hence, are evaluated in order,one at a time, without regard to the notion that the absence of oneextension necessarily implicates that another extension is not presentor implicated. While this standard is adequate for cases where theextensions are truly independent, it can result in wasted operations andinstructions when the extensions are not. Accordingly, there is a needfor a PPS syntax that efficiently provides for extensions that are notindependent. This disclosure presents a description of a PPS syntax thatsatisfies this need.

SUMMARY

To address the requirements described above, this document discloses amemory structure for signaling extension functions used in decoding asequence comprising a plurality of pictures, each picture processed atleast in part according to a picture parameter set is disclosed. In oneembodiment, the method comprises reading a first extension flagsignaling a first extension function in the processing of the sequenceand determining if the first extension flag has a first value. Further,the method reads a second extension flag signaling a second extensionfunction in the processing of the sequence and performs the secondextension function according to the read second extension flag only ifthe first extension flag has a first value. Another embodiment isdisclosed in which an apparatus is evidenced by a processor having acommunicatively coupled memory storing instructions for performing theforegoing operations.

BRIEF DESCRIPTION OF THE DRAWINGS

Referring now to the drawings in which like reference numbers representcorresponding parts throughout:

FIG. 1 is a diagram depicting an exemplary embodiment of a videocoding-decoding system that can be used for transmission and/or storageand retrieval of audio and/or video information;

FIG. 2A is a diagram of one embodiment of a codec system in which theencoded AV information is transmitted to and received at anotherlocation;

FIGS. 2B-2C provide diagrams depicting embodiments of codec systems;

FIG. 3 is a block diagram illustrating one embodiment of the sourceencoder;

FIG. 4 is a diagram depicting a picture of AV information, such as oneof the pictures in the picture sequence;

FIG. 5 is a diagram showing an exemplary partition of a coding treeblock into coding units;

FIG. 6 is a diagram illustrating a representation of a representativequadtree and data parameters for the code tree block partitioning shownin FIG. 5;

FIG. 7 is a diagram illustrating the partition of a coding unit into oneor more prediction units;

FIG. 8 is a diagram showing a coding unit partitioned into fourprediction units and an associated set of transform units;

FIG. 9 is a diagram showing RQT codetree for the transform unitsassociated with the coding unit in the example of FIG. 8;

FIG. 10 is a diagram illustrating spatial prediction of predictionunits;

FIG. 11 is a diagram illustrating temporal prediction;

FIG. 12 is a diagram illustrating the use of motion vector predictors(MVPs);

FIG. 13 illustrates an example of the use of the reference picturelists;

FIG. 14 is a diagram illustrating processes performed by the encoderaccording to the aforementioned standard;

FIG. 15 depicts the use of a the collocated_from_10_flag by the decoderin decoding a according to the emerging HEVC standard;

FIGS. 16A and 16B are diagrams presenting a baseline PPS syntax;

FIGS. 16C and 16D are diagrams presenting an improved PPS syntax;

FIG. 17 illustrates an exemplary processing system that could be used toimplement the embodiments of the invention.

DETAILED DESCRIPTION

In the following description, reference is made to the accompanyingdrawings which form a part hereof, and which is shown, by way ofillustration, several embodiments of the present invention. It isunderstood that other embodiments may be utilized and structural changesmay be made without departing from the scope of the present invention.

Audio-Visual Information Transception and Storage

FIG. 1 is a diagram depicting an exemplary embodiment of a videocoding-decoding (codec) system 100 that can be used for transmissionand/or storage and retrieval of audio and/or video information. Thecodec system 100 comprises an encoding system 104, which acceptsaudio-visual (AV) information 102 and processes the AV information 102to generate encoded (compressed) AV information 106, and a decodingsystem 112, which processes the encoded AV information 106 to producerecovered AV information 114. Since the encoding and decoding processesare not lossless, the recovered AV information 114 is not identical tothe initial AV information 102, but with judicious selection of theencoding processes and parameters, the differences between the recoveredAV information 114 and the unprocessed AV information 102 are acceptableto human perception.

The encoded AV information 106 is typically transmitted or stored andretrieved before decoding and presentation, as performed by transception(transmission and reception) or storage/retrieval system 108.Transception losses may be significant, but storage/retrieval losses aretypically minimal or non-existent, hence, the transcepted AV information110 provided to the decoding system 112 is typically the same as orsubstantially the same as the encoded AV information 106.

FIG. 2A is a diagram of one embodiment of a codec system 200A in whichthe encoded AV information 106 is transmitted to and received at anotherlocation. A transmission segment 230 converts an input AV information102 into a signal appropriate for transmission and transmits theconverted signal over the transmission channel 212 to the receptionsegment 232. The reception segment 232 receives the transmitted signaland converts the received signal into the recovered AV information 114for presentation. As described above, due to coding and transmissionlosses and errors, the recovered AV information 114 may be of lowerquality than the AV information 102 that was provided to thetransmission segment 230. However, error-correcting systems may beincluded to reduce or eliminate such errors. For example, the encoded AVinformation 106 may be forward error correction (FEC) encoded by addingredundant information, and such redundant information can be used toidentify and eliminate errors in the reception segment 230.

The transmission segment 102 comprises one or more source encoders 202to encode multiple sources of AV information 102. The source encoder 202encodes the AV information 102 primarily for purposes of compression toproduce the encoded AV information 106, and may include, for example aprocessor and related memory storing instructions implementing a codecsuch as MPEG-1, MPEG-2, MPEG-4 AVC/H.264, HEVC or similar codec, asdescribed further below.

The codec system 200A may also include optional elements indicated bythe dashed lines in FIG. 2A. These optional elements include a videomultiplex encoder 204, an encoding controller 208, and a videodemultiplexing decoder 218. The optional video multiplex encoder 204multiplexes encoded AV information 106 from an associated plurality ofsource encoder(s) 202 according to one or more parameters supplied bythe optional encoding controller 208. Such multiplexing is typicallyaccomplished in the time domain and is data packet based.

In one embodiment, the video multiplex encoder 204 comprises astatistical multiplexer, which combines the encoded AV information 106from a plurality of source encoders 202 so as to minimize the bandwidthrequired for transmission. This is possible since the instantaneous bitrate of the coded AV information 106 from each source encoder 202 canvary greatly with time according to the content of the AV information102. For example, scenes having a great deal of detail and motion (e.g.sporting events) are typically encoded at higher bitrates than sceneswith little motion or detail (e.g. portrait dialog). Since each sourceencoder 202 may produce information with a high instantaneous bitratewhile another source encoder 202 produces information with a lowinstantaneous bit rate, and since the encoding controller 208 cancommand the source encoders 202 to encode the AV information 106according to certain performance parameters that affect theinstantaneous bit rate, the signals from each of the source encoders 106(each having a temporally varying instantaneous bit rate) can becombined together in an optimal way to minimize the instantaneous bitrate of the multiplexed stream 205.

As described above, the source encoder 202 and the video multiplex coder204 may optionally be controlled by a coding controller 208 to minimizethe instantaneous bit rate of the combined video signal. In oneembodiment, this is accomplished using information from a transmissionbuffer 206 which temporarily stores the coded video signal and canindicate the fullness of the buffer 206. This allows the codingperformed at the source encoder 202 or video multiplex coder 204 to be afunction of the storage remaining in the transmission buffer 206.

The transmission segment 230 also may comprise a transmission encoder210, which further encodes the video signal for transmission to thereception segment 232. Transmission encoding may include for example,the aforementioned FEC coding and/or coding into a multiplexing schemefor the transmission medium of choice. For example, if the transmissionis by satellite or terrestrial transmitters, the transmission encoder114 may encode the signal into a signal constellation beforetransmission via quadrature amplitude modulation (QAM) or similarmodulation technique. Also, if the encoded video signal is to bestreamed via an Internet protocol device and the Internet, thetransmission encodes the signal according to the appropriate protocol.Further, if the encoded signal is to be transmitted via mobiletelephony, the appropriate coding protocol is used, as further describedbelow.

The reception segment 232 comprises a transmission decoder 214 toreceive the signal that was coded by the transmission coder 210 using adecoding scheme complementary to the coding scheme used in thetransmission encoder 214. The decoded received signal may be temporarilystored by optional reception buffer 216, and if the received signalcomprises multiple video signals, the received signal is multiplexdecoded by video multiplex decoder 218 to extract the video signal ofinterest from the video signals multiplexed by the video multiplex coder204. Finally, the video signal of interest is decoded by source decoder220 using a decoding scheme or codec complementary to the codec used bythe source encoder 202 to encode the AV information 102.

In one embodiment, the transmitted data comprises a packetized videostream transmitted from a server (representing the transmitting segment230) to a client (representing the receiving segment 232). In this case,the transmission encoder 210 may packetize the data and embed networkabstract layer (NAL) units in network packets. NAL units define a datacontainer that has header and coded elements and may correspond to avideo frame or other slice of video data.

The compressed data to be transmitted may packetized and transmitted viatransmission channel 212, which may include a Wide Area Network (WAN) ora Local Area Network (LAN). Such a network may comprise, for example, awireless network such as WiFi, an Ethernet network, an Internet networkor a mixed network composed of several different networks. Suchcommunication may be affected via a communication protocol, for exampleReal-time Transport Protocol (RIP), User Datagram Protocol (UDP) or anyother type of communication protocol. Different packetization methodsmay be used for each network abstract layer (NAL) unit of the bitstream.In one case, one NAL unit size is smaller than the maximum transportunit (MTU) size corresponding to the largest packet size that can betransmitted over the network without being fragmented. In this case, theNAL unit is embedded into a single network packet. In another case,multiple entire NAL units are included in a single network packet. In athird case, one NAL unit may be too large to be transmitted in a singlenetwork packet and is thus split into several fragmented NAL units witheach fragmented NAL unit being transmitted in an individual networkpacket. Fragmented NAL unit are typically sent consecutively fordecoding purposes.

The reception segment 232 receives the packetized data and reconstitutesthe NAL units from the network packet. For fragmented NAL units, theclient concatenates the data from the fragmented NAL units in order toreconstruct the original NAL unit. The client 232 decodes the receivedand reconstructed data stream and reproduces the video images on adisplay device and the audio data by a loud speaker.

FIG. 2B is a diagram depicting an exemplary embodiment of codec systemin which the encoded information is stored and later retrieved forpresentation, hereinafter referred to as codec storage system 200B. Thisembodiment may be used, for example, to locally store information in adigital video recorder (DVR), a flash drive, hard drive, or similardevice. In this embodiment, the AV information 102 is source encoded bysource encoder 202, optionally buffered by storage buffer 234 beforestorage in a storage device 236. The storage device 236 may store thevideo signal temporarily or for an extended period of time, and maycomprise a hard drive, flash drive, RAM or ROM. The stored AVinformation is then retrieved, optionally buffered by retrieve buffer238 and decoded by the source decoder 220.

FIG. 2C is another diagram depicting an exemplary content distributionsystem 200C comprising a coding system or encoder 202 and a decodingsystem or decoder 220 that can be used to transmit and receive HEVCdata. In some embodiments, the coding system 202 can comprise an inputinterface 256, a controller 241 a counter 242 a frame memory 243, anencoding unit 244, a transmitter buffer 267 and an output interface 257.The decoding system 220 can comprise a receiver buffer 259, a decodingunit 260, a frame memory 261 and a controller 267. The coding system 202and the decoding system 220 can be coupled with each other via atransmission path which can carry a compressed bit stream. Thecontroller 241 of the coding system 202 can control the amount of datato be transmitted on the basis of the capacity of the transmitter buffer267 or receiver buffer 259 and can include other parameters such as theamount of data per a unit of time. The controller 241 can control theencoding unit 244 to prevent the occurrence of a failure of a receivedsignal decoding operation of the decoding system 220. The controller 241can be a processor or include, by way of a non-limiting example, amicrocomputer having a processor, a random access memory and a read onlymemory.

Source pictures 246 supplied from, by way of a non-limiting example, acontent provider can include a video sequence of frames including sourcepictures in a video sequence. The source pictures 246 can beuncompressed or compressed. If the source pictures 246 are uncompressed,the coding system 202 can have an encoding function. If the sourcepictures 246 are compressed, the coding system 202 can have atranscoding function. Coding units can be derived from the sourcepictures utilizing the controller 241. The frame memory 243 can have afirst area that can be used for storing the incoming frames from thesource pictures 246 and a second area that can be used for reading outthe frames and outputting them to the encoding unit 244. The controller241 can output an area switching control signal 249 to the frame memory243. The area switching control signal 249 can indicate whether thefirst area or the second area is to be utilized.

The controller 241 can output an encoding control signal 250 to theencoding unit 244. The encoding control signal 250 can cause theencoding unit 202 to start an encoding operation, such as preparing theCoding Units based on a source picture. In response to the encodingcontrol signal 250 from the controller 241, the encoding unit 244 canbegin to read out the prepared Coding Units to a high-efficiencyencoding process, such as a prediction coding process or a transformcoding process which process the prepared Coding Units generating videocompression data based on the source pictures associated with the CodingUnits.

The encoding unit 244 can package the generated video compression datain a packetized elementary stream (PES) including video packets. Theencoding unit 244 can map the video packets into an encoded video signal248 using control information and a program time stamp (PTS) and theencoded video signal 248 can be transmitted to the transmitter buffer267.

The encoded video signal 248, including the generated video compressiondata, can be stored in the transmitter buffer 267. The informationamount counter 242 can be incremented to indicate the total amount ofdata in the transmitter buffer 267. As data is retrieved and removedfrom the buffer, the counter 242 can be decremented to reflect theamount of data in the transmitter buffer 267. The occupied areainformation signal 253 can be transmitted to the counter 242 to indicatewhether data from the encoding unit 244 has been added or removed fromthe transmitter buffer 267 so the counter 242 can be incremented ordecremented. The controller 241 can control the production of videopackets produced by the encoding unit 244 on the basis of the occupiedarea information 253 which can be communicated in order to anticipate,avoid, prevent, and/or detect an overflow or underflow from taking placein the transmitter buffer 267.

The information amount counter 242 can be reset in response to a presetsignal 254 generated and output by the controller 241. After theinformation amount counter 242 is reset, it can count data output by theencoding unit 244 and obtain the amount of video compression data and/orvideo packets, which have been generated. The information amount counter242 can supply the controller 241 with an information amount signal 255representative of the obtained amount of information. The controller 241can control the encoding unit 244 so that there is no overflow at thetransmitter buffer 267.

In some embodiments, the decoding system 220 can comprise an inputinterface 266, a receiver buffer 259, a controller 267, a frame memory261, a decoding unit 260 and an output interface 267. The receiverbuffer 259 of the decoding system 220 can temporarily store thecompressed bit stream, including the received video compression data andvideo packets based on the source pictures from the source pictures 246.The decoding system 220 can read the control information andpresentation time stamp information associated with video packets in thereceived data and output a frame number signal 263 which can be appliedto the controller 220. The controller 267 can supervise the countednumber of frames at a predetermined interval. By way of a non-limitingexample, the controller 267 can supervise the counted number of frameseach time the decoding unit 260 completes a decoding operation.

In some embodiments, when the frame number signal 263 indicates thereceiver buffer 259 is at a predetermined capacity, the controller 267can output a decoding start signal 264 to the decoding unit 260. Whenthe frame number signal 263 indicates the receiver buffer 259 is at lessthan a predetermined capacity, the controller 267 can wait for theoccurrence of a situation in which the counted number of frames becomesequal to the predetermined amount. The controller 267 can output thedecoding start signal 263 when the situation occurs. By way of anon-limiting example, the controller 267 can output the decoding startsignal 264 when the frame number signal 263 indicates the receiverbuffer 259 is at the predetermined capacity. The encoded video packetsand video compression data can be decoded in a monotonic order (i.e.,increasing or decreasing) based on presentation time stamps associatedwith the encoded video packets.

In response to the decoding start signal 264, the decoding unit 260 candecode data amounting to one picture associated with a frame andcompressed video data associated with the picture associated with videopackets from the receiver buffer 259. The decoding unit 260 can write adecoded video signal 269 into the frame memory 261. The frame memory 261can have a first area into which the decoded video signal is written,and a second area used for reading out decoded pictures 262 to theoutput interface 267.

In various embodiments, the coding system 202 can be incorporated orotherwise associated with a transcoder or an encoding apparatus at aheadend and the decoding system 220 can be incorporated or otherwiseassociated with a downstream device, such as a mobile device, a set topbox or a transcoder.

Source Encoding/Decoding

As described above, the encoders 202 employ compression algorithms togenerate bit streams and/or files of smaller size than the originalvideo sequences in the AV information 102. Such compression is madepossible by reducing spatial and temporal redundancies in the originalsequences.

Prior art encoders 202 include those compliant with the videocompression standard H.264/MPEG-4 AVC (“Advanced Video Coding”)developed by between the “Video Coding Expert Group” (VCEG) of the ITUand the “Moving Picture Experts Group” (MPEG) of the ISO, in particularin the form of the publication “Advanced Video Coding for GenericAudiovisual Services” (March 2005), which is hereby incorporated byreference herein.

HEVC “High Efficiency Video Coding” (sometimes known as H.265) isexpected to replace the H.264/MPEG-4 AVC. HEVC introduces new codingtools and entities that are generalizations of the coding entitiesdefined in H.264/AVC, as further described below.

FIG. 3 is a block diagram illustrating one embodiment of the sourceencoder 202. The source encoder 202 accepts AV information 102 and usessampler 302 sample the AV information 102 to produce a sequence 303 ofsuccessive of digital images or pictures, each having a plurality ofpixels. A picture can comprise a frame or a field, wherein a frame is acomplete image captured during a known time interval, and a field is theset of odd-numbered or even-numbered scanning lines composing a partialimage.

The sampler 302 produces an uncompressed picture sequence 303. Eachdigital picture can be represented by one or more matrices having aplurality of coefficients that represent information about the pixelsthat together comprise the picture. The value of a pixel can correspondto luminance or other information. In the case where several componentsare associated with each pixel (for example red-green-blue components orluminance-chrominance components), each of these components may beseparately processed.

Images can be segmented into “slices,” which may comprise a portion ofthe picture or may comprise the entire picture. In the H.264 standard,these slices are divided into coding entities called macroblocks(generally blocks of size 16 pixels×16 pixels) and each macroblock mayin turn be divided into different sizes of data blocks 102, for example4×4, 4×8, 8×4, 8×8 8×16, 16×8. HEVC expands and generalizes the notionof the coding entity beyond that of the macroblock.

HEVC Coding Entities: CTU, CU, PU and TU

Like other video coding standards, HEVC is a block-based hybrid spatialand temporal predictive coding scheme. However, HEVC introduces newcoding entities that are not included with H.264/AVC standard. Thesecoding entities include (1) Coding tree block (CTUs), coding units(CUs), the predictive units (PUs) and transform units (TUs) and arefurther described below.

FIG. 4 is a diagram depicting a picture 400 of AV information 102, suchas one of the pictures in the picture sequence 303. The picture 400 isspatially divided into non-overlapping square blocks known as codingtree units(s), or CTUs 402. Unlike H.264 and previous video codingstandards where the basic coding unit is macroblock of 16×16 pixels, theCTU 402 is the basic coding unit of HEVC and can be as large as 128×128pixels. As shown in FIG. 4, the CTUs 402 are typically referenced withinthe picture 400 in an order analogous to a progressive scan.

Each CTU 402 may in turn be iteratively divided into smaller variablesize coding units described by a “quadtree” decomposition furtherdescribed below. Coding units are regions formed in the image to whichsimilar encoding parameters are applied and transmitted in the bitstream314.

FIG. 5 is a diagram showing an exemplary partition of an CTU 402 intocoding units (CUs) such as coding unit 502A and 502B (hereinafteralternatively referred to as coding unit(s) 502). A single CTU 402 canbe divided into four CUs 502 such as CU 502A, each a quarter of the sizeof CTU 402. Each such divided CU 502A can be further divided into foursmaller CUs 502B of quarter size of initial CU 502A.

The division of CTUs 402 into CUs 502A and into smaller CUs 502B isdescribed by “quadtree” data parameters (e.g. flags or bits) that areencoded into the output bitstream 314 along with the encoded data asoverhead known as syntax.

FIG. 6 is a diagram illustrating a representation of a representativequadtree 600 and data parameters for the CTU 402 partitioning shown inFIG. 5. The quadtree 600 comprises a plurality of nodes including firstnode 602A at one hierarchical level and second node 602B at a lowerhierarchical level (hereinafter, quadtree nodes may be alternativelyreferred to as “nodes” 602). At each node 602 of a quadtree, a “splitflag” or bit “1” is assigned if the node 602 is further split intosub-nodes, otherwise a bit “0” is assigned.

For example, the CTU 402 partition illustrated in FIG. 5 can berepresented by the quadtree 600 presented in FIG. 6, which includes asplit flag of “1” associated with node 602A at the top CU 502 level(indicating there are 4 additional nodes at a lower hierarchical level).The illustrated quadtree 600 also includes a split flag of “1”associated with node 602B at the mid CU 502 level to indicate that thisCU is also partitioned into four further CUs 502 at the next (bottom) CUlevel. The source encoder 202 may restrict the minimum and maximum CU502 sizes, thus changing the maximum possible depth of the CU 502splitting.

The encoder 202 generates encoded AV information 106 in the form of abitstream 314 that includes a first portion having encoded data for theCUs 502 and a second portion that includes overhead known as syntaxelements. The encoded data includes data corresponding to the encodedCUs 502 (i.e. the encoded residuals together with their associatedmotion vectors, predictors, or related residuals as described furtherbelow). The second portion includes syntax elements that may representencoding parameters which do not directly correspond to the encoded dataof the blocks. For example, the syntax elements may comprise an addressand identification of the CU 502 in the image, a quantization parameter,an indication of the elected Inter/Intra coding mode, the quadtree 600or other information.

CUs 502 correspond to elementary coding elements and include two relatedsub-units: prediction units (PUs) and a transform units (TUs), both ofwhich have a maximum size equal to the size of the corresponding CU 502.

FIG. 7 is a diagram illustrating the partition of a CU 502 into one ormore PUs 702. A PU 702 corresponds to a partitioned CU 502 and is usedto predict pixels values for intra-picture or inter-picture types. PUs702 are an extension of the partitioning of H.264/AVC for motionestimation and are defined for each CU 502 that is not furthersubdivided into other CUs (“split flag”=0). At each leaf 604 of thequadtree 600, a final (bottom level) CU 502 of 2N×2N can possess one offour possible patterns of PUs: 2N×2N (702A), 2N×N (702B), N×2N (702C)and N×N (702D)), as shown in FIG. 7.

A CU 502 can be either spatially or temporally predictive coded. If a CU502 is coded in “intra” mode, each PU 702 of the CU 502 can have its ownspatial prediction direction and image information as further describedbelow. Also, in the “intra” mode, the PU 702 of the CU 502 may depend onanother CU 502 because it may use a spatial neighbor, which is inanother CU. If a CU 502 is coded in “inter” mode, each PU 702 of the CU502 can have its own motion vector(s) and associated referencepicture(s) as further described below.

FIG. 8 is a diagram showing a CU 502 partitioned into four PUs 702 andan associated set of transform units (TUs) 802. TUs 802 are used torepresent the elementary units that are spatially transformed by a DCT(Discrete Cosine Transform). The size and location of each blocktransform TU 802 within a CU 502 is described by a “residual” quadtree(RQT) further illustrated below.

FIG. 9 is a diagram showing RQT 900 for TUs 802 for the CU 502 in theexample of FIG. 8. Note that the “1” at the first node 902A of the RQT900 indicates that there are four branches and that the “1” at thesecond node 902B at the adjacent lower hierarchical level indicates thatthe indicated node further has four branches. The data describing theRQT 900 is also coded and transmitted as an overhead in the bitstream314.

The coding parameters of a video sequence may be stored in dedicated NALunits called parameter sets. Two types of parameter sets NAL units maybe employed. The first parameter set type is known as a SequenceParameter Set (SPS) and comprises a NAL unit that includes parametersthat are unchanged during the entire video sequence. Typically, an SPShandles the coding profile, the size of the video frames and otherparameters. The second type of parameter set is known as a PictureParameter Set (PPS), and codes different values that may change from oneimage to another.

Spatial and Temporal Prediction

One of the techniques used to compress a bitstream 314 is to forego thestorage of pixel values themselves and instead, predict the pixel valuesusing a process that can be repeated at the decoder 220 and store ortransmit the difference between the predicted pixel values and theactual pixel values (known as the residual). So long as the decoder 220can compute the same predicted pixel values from the informationprovided, the actual picture values can be recovered by adding theresiduals to the predicted values. The same technique can be used tocompress other data as well.

Referring back to FIG. 3, each PU 702 of the CU 502 being processed isprovided to a predictor module 307. The predictor module 307 predictsthe values of the PUs 702 based on information in nearby PUs 702 in thesame frame (intra-frame prediction, which is performed by the spatialpredictor 324) and information of PUs 702 in temporally proximate frames(inter-frame prediction, which is performed by the temporal predictor330). Temporal prediction, however, may not always be based on acollocated PU, since collocated PUs are defined to be located at areference/non-reference frame having the same x and y coordinates as thecurrent PU 702. These techniques take advantage of spatial and temporaldependencies between PUs 702.

Encoded units can therefore be categorized to include two types: (1)non-temporally predicted units and (2) temporally predicted units.Non-temporally predicted units are predicted using the current frame,including adjacent or nearby PUs 702 within the frame (e.g. intra-frameprediction), and are generated by the spatial predictor 324. Temporallypredicted units are predicted from one temporal picture (e.g. P-frames)or predicted from at least two reference pictures temporally aheadand/or behind (i.e. B-frames).

Spatial Prediction

FIG. 10 is a diagram illustrating spatial prediction of PUs 702. Apicture may comprise a PU 702 and spatially proximate other PUs 1-4,including nearby PU 702N. The spatial predictor 324 predicts the currentblock (e.g. block C of FIG. 10) by means of an “intra-frame” predictionwhich uses PUs 702 of already-encoded other blocks of pixels of thecurrent image.

The spatial predictor 324 locates a nearby PU (e.g. PU 1, 2, 3 or 4 ofFIG. 10) that is appropriate for spatial coding and determines anangular prediction direction to that nearby PU. In HEVC, 35 directionscan be considered, so each PU may have one of 35 directions associatedwith it, including horizontal, vertical, 45 degree diagonal, 135 degreediagonal, DC etc. The spatial prediction direction of the PU isindicated in the syntax.

Referring back to the spatial predictor 324 of FIG. 3, this locatednearby PU is used to compute a residual PU 704 (e) as the differencebetween the pixels of the nearby PU 702N and the current PU 702, usingelement 305. The result is an intra-predicted PU element 1006 thatcomprises a prediction direction 1002 and the intra-predicted residualPU 1004. The prediction direction 1002 may be coded by inferring thedirection from spatially proximate PUs, and the spatial dependencies ofthe picture, enabling the coding rate of the intra prediction directionmode to be reduced.

Temporal Prediction

FIG. 11 is a diagram illustrating temporal prediction. Temporalprediction considers information from temporally neighboring pictures orframes, such as the previous picture, picture i−1.

Generally, temporal prediction includes single-prediction (P-type),which predicts the PU 702 by referring to one reference area from onlyone reference picture, and multiple prediction (B-type), which predictsthe PU by referring to two reference areas from one or two referencepictures. Reference images are images in the video sequence that havealready been coded and then reconstructed (by decoding).

The temporal predictor 330 identifies, in one or several of thesereference areas (one for P-type or several for B-type), areas of pixelsin a temporally nearby frame so that they can be used as predictors ofthis current PU 702. In the case where several areas predictors are used(B-type), they may be merged to generate one single prediction. Thereference area 1102 is identified in the reference frame by a motionvector (MV)1104 that is defines the displacement between the current PU702 in current frame (picture i) and the reference area 1102 (refIdx) inthe reference frame (picture i−1). A PU in a B-picture may have up totwo MVs. Both MV and refIdx information are included in the syntax ofthe HEVC bitstream.

Referring again to FIG. 3, a difference between the pixel values betweenof the reference area 1102 and the current PU 702 may be computed byelement 305 as selected by switch 306. This difference is referred to asthe residual of the inter-predicted PU 1106. At the end of the temporalor inter-frame prediction process, the current PU 1006 is composed ofone motion vector MV 1104 and a residual 1106.

However, as described above, one technique for compressing data is togenerate predicted values for the data using means repeatable by thedecoder 220, computing the difference between the predicted and actualvalues of the data (the residual) and transmitting the residual fordecoding. So long as the decoder 220 can reproduce the predicted values,the residual values can be used to determine the actual values.

This technique can be applied to the MVs 1104 used in temporalprediction by generating a prediction of the MV 1104, computing adifference between the actual MV 1104 and the predicted MV 1104 (aresidual) and transmitting the MV residual in the bitstream 314. So longas the decoder 220 can reproduce the predicted MV 1104, the actual MV1104 can be computed from the residual. HEVC computes a predicted MV foreach PU 702 using the spatial correlation of movement between nearby PUs702.

FIG. 12 is a diagram illustrating the use of motion vector predictors(MVPs) in HEVC. Motion vector predictors V₁, V₂ and V₃ are taken fromthe MVs 1104 of a plurality of blocks 1, 2, and 3 situated nearby oradjacent the block to encode (C). As these vectors refer to motionvectors of spatially neighboring blocks within the same temporal frameand can be used to predict the motion vector of the block to encode,these vectors are known as spatial motion predictors.

FIG. 12 also illustrates temporal motion vector predictor VT which isthe motion vector of the co-located block C′ in a previously decodedpicture (in decoding order) of the sequence (e.g. block of picture i−1located at the same spatial position as the block being coded (block Cof image i).

The components of the spatial motion vector predictors V₁, V₂ and V₃ andthe temporal motion vector predictor VT can be used to generate a medianmotion vector predictor V_(M). In HEVC, the three spatial motion vectorpredictors may be taken as shown in FIG. 12, that is, from the blocksituated to the left of the block to encode (V₁), the block situatedabove (V₃) and from one of the blocks situated at the respective cornersof the block to encode (V₂), according to a predetermined rule ofavailability. This MV predictor selection technique is known as AdvancedMotion Vector Prediction (AMVP).

A plurality of (typically five) MV predictor (MVP) candidates havingspatial predictors (e.g. V₁, V₂ and V₃) and temporal predictor(s) VT istherefore obtained. In order to reduce the overhead of signaling themotion vector predictor in the bitstream, the set of motion vectorpredictors may reduced by eliminating data for duplicated motion vectors(for example, MVs which have the same value as other MVs may beeliminated from the candidates).

The encoder 202 may select a “best” motion vector predictor from amongthe candidates, and compute a motion vector predictor residual as adifference between the selected motion vector predictor and the actualmotion vector, and transmit the motion vector predictor residual in thebitstream 314. To perform this operation, the actual motion vector mustbe stored for later use by the decoder 220 (although it is nottransmitted in the bit stream 314. Signaling bits or flags are includedin the bitstream 314 to specify which MV residual was computed from thenormalized motion vector predictor and are later used by the decoder torecover the motion vector. These bits or flags are further describedbelow.

Referring back to FIG. 3, the intra-predicted residuals 1004 and theinter-predicted residuals 1106 obtained from the spatial (intra) ortemporal (inter) prediction process are then transformed by transformmodule 308 into the transform units (TUs) 802 described above. A TU 802can be further split into smaller TUs using the RQT decompositiondescribed above with respect to FIG. 9. In HEVC, generally 2 or 3 levelsof decompositions are used and authorized transform sizes are from32×32, 16×16, 8×8 and 4×4. As described above, the transform is derivedaccording to a discrete cosine transform (DCT) or discrete sinetransform (DST).

The residual transformed coefficients are then quantized by quantizer310. Quantization plays a very important role in data compression. InHEVC, quantization converts the high precision transform coefficientsinto a finite number of possible values. Although the quantizationpermits a great deal of compression, quantization is a lossy operation,and the loss by quantization cannot be recovered.

The coefficients of the quantized transformed residual are then coded bymeans of an entropy coder 312 and then inserted into the compressed bitstream 310 as a part of the useful data coding the images of the AVinformation. Coding syntax elements may also be coded using spatialdependencies between syntax elements to increase the coding efficiency.HEVC offers context-adaptive binary arithmetic coding (CABAC). Otherforms or entropy or arithmetic coding may also be used.

In order to calculate the predictors used above, the encoder 202 decodesalready encoded PUs 702 using “decoding” loop 315, which includeselements 316, 318, 320, 322, 328. This decoding loop 315 reconstructsthe PUs and images from the quantized transformed residuals.

The quantized transform residual coefficients E are provided todequantizer 316, which applies the inverse operation to that ofquantizer 310 to produce dequantized transform coefficients of theresidual PU (E) 708. The dequantized data 708 is then provided toinverse transformer 318 which applies the inverse of the transformapplied by the transform module 308 to generate reconstructed residualcoefficients of the PU (e) 710.

The reconstructed coefficients of the residual PU 710 are then added tothe corresponding coefficients of the corresponding predicted PU (x′)702′ selected from the intra-predicted PU 1004 and the inter-predictedPU 1106 by selector 306. For example, if the reconstructed residualcomes from the “intra” coding process of the spatial predictor 324, the“intra” predictor (x′) is added to this residual in order to recover areconstructed PU (x″) 712 corresponding to the original PU 702 modifiedby the losses resulting from a transformation, for example in this casethe quantization operations. If the residual 710 comes from an “inter”coding process of the temporal predictor 330, the areas pointed to bythe current motion vectors (these areas belong to the reference imagesstored in reference buffer 328 referred by the current image indices)are merged then added to this decoded residual. In this way the originalPU 702 is modified by the losses resulting from the quantizationoperations.

To the extent that the encoder 202 uses motion vector predictiontechniques analogous to the image prediction techniques described above,the motion vector may be stored using motion vector buffer 329 for usein temporally subsequent frames. As further described below, a flag maybe set and transferred in the syntax to indicate that the motion vectorfor the currently decoded frame should be used for at least thesubsequently coded frame instead of replacing the contents of the MVbuffer 329 with the MV for the current frame.

A loop filter 322 is applied to the reconstructed signal (x″) 712 inorder to reduce the effects created by heavy quantization of theresiduals obtained, and to improve the signal quality. The loop filter322 may comprise, for example, a deblocking filter for smoothing bordersbetween PUs to visually attenuate high frequencies created by the codingprocess and a linear filter that is applied after all of the PUs for animage have been decoded to minimize the sum of the square difference(SSD) with the original image. The linear filtering process is performedon a frame by frame basis and uses several pixels around the pixel to befiltered, and also uses spatial dependencies between pixels of theframe. The linear filter coefficients may be coded and transmitted inone header of the bitstream typically a picture or slice header.

The filtered images, also known as reconstructed images, are then storedas reference images from reference image buffer 328 in order to allowthe subsequent “Inter” predictions taking place during the compressionof the subsequent images of the current video sequence.

Reference Image Syntax

As described above, to reduce errors and improve compression, HEVCpermits the use of several reference images for the estimation andmotion compensation of the current image. Given a current PU 702 in acurrent picture, the collocated PU 1102 for a particular slice residesin associated nearby reference/non-reference picture. For example, inFIG. 12, the collocated PU 1102 for current PU 702 in picture (i)resides in the associated nearby reference picture (i−1). The best“inter” or temporal predictors of the current PU 702 are selected insome of the multiple reference/non-reference images, which may be basedon pictures temporally prior to or after the current picture in displayorder (backwards and forward prediction, respectively).

For HEVC, the index to reference pictures is defined by referencepicture lists that are described in the slice syntax. Forward predictionis defined by list_0 (RefPicList0), and backward prediction is definedby list_1 (RefPicList1), and both list 0 and list 1 can contain multiplereference pictures prior to or/and later than the current picture in thedisplay order.

FIG. 13 illustrates an example of the use of the reference picturelists. Consider pictures 0, 2, 4, 5, 6, 8 and 10 shown in FIG. 13,wherein the numbers of each picture denote display order and the currentpicture is picture 5. In this case, the list_0 reference pictures withascending reference picture indices and starting with index equal tozero are 4, 2, 0, 6, 8 and 10, and the list_1 reference pictures withascending reference picture indices and starting with index equal tozero are 6, 8, 10, 4, 2, and 0. A slice that the motion compensatedprediction is restricted to the list_0 prediction is called a predictiveor P-slice. Collocated pictures are indicated by using thecollocated_ref_idx index in the HEVC. A slice for which themotion-compensated prediction includes more than one reference pictureis a bi-predictive or B-slice. For B-slices, the motion compensatedprediction may include reference pictures from list_1 prediction as wellas list_0.

Hence, a collocated PU 1102 is disposed in a reference picture specifiedin either list_0 or list_1. A flag (collocated_from_10_flag) is used tospecify whether the collocated partition should be derived from list_0or list_1 for a particular slice type. Each of the reference pictures isalso associated with a motion vector.

The storage and retrieval of reference pictures and related motionvectors for the emerging HEVC standard is expressed in paragraph8.4.1.2.9 of Benjamin Bross, Woo Jin Han, Jens-Rainer Ohm, Gary J.Sullivan, Thomas Wiegand, “WD4: Working Draft 4 of High-Efficiency VideoCoding,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16WP3 and ISO/IEC JTC1/SC29/WG11, JCTVC-F803_d5, 6th Meeting: Torino, IT,14-22 Jul. 2011 (hereby incorporated by reference herein).

According to the standard, if the slice_type is equal to B and thecollocated_from_10_flag is 0, the collocated_ref_idx variable specifiesthe reference picture as the picture that contains the co-locatedpartition as specified by RefPicList1. Otherwise (slice_type is equal toB and collocated_from_10_flag is equal to 1 or slice_type is equal toP), the collocated_ref_idx variable specifies the reference picture asthe picture that contains the collocated partition as specified byRefPicList0.

FIG. 14 is a diagram illustrating processes performed by the encoder 202according to the aforementioned standard. Block 1402 determines whetherthe current picture is a reference picture for another picture. If not,there is no need to store reference picture or motion vectorinformation. If the current picture is a reference picture for anotherpicture, block 1504 determines whether the “another” picture is a P-typeor a B-type picture. If the picture is a P-type picture, processing ispassed to blocks 1410, which set the colloc_from_10_flag to one andstore the reference picture and motion vector in list 0. If the “anotherpicture” is a B-type picture, block 1406 nonetheless directs processingto blocks 1408 and 1410 if the desired reference picture is to be storedin list 0, and to blocks 1412 and 1414 if the desired reference pictureand motion vector is to be stored in list 1. This decision may be basedon whether it is desirable to select reference pictures from atemporally preceding or succeeding picture. Which of the multiplepossible reference pictures is selected is determined according to thecollocated_ref_idx index.

FIG. 15 depicts the use of a collocated_from_10_flag by the decoder 220in decoding a according to the previous HEVC standard. Block 1502determines if the current slice type being computed is an intra orI-type. Such slices do not use temporally nearby slices in theencoding/decoding process, and hence there is no need to find atemporally nearby reference picture. If the slice type is not I-type,block 1504 determines whether the slice is a B-slice. If the slice isnot a B-type, it is a P-type slice, and the reference picture thatcontains the collocated partition is found in list 0, according to thevalue of collocated_ref_idx. If the slice is B-type, thecollocated_from_10_flag determines whether the reference picture isfound in list 0 or list 1. As the index indicates, the collocatedpicture is therefore defined as the reference picture having theindicated collocated_ref_idx in either list 0 or list 1, depending onthe slice type (B-type or P-type) and the value of thecollocated_from_10_flag. In one embodiment of HEVC, the first referencepicture (the reference picture having index [0] as shown in FIG. 13 isselected as the collocated picture).

Baseline Picture Parameter Set Syntax

FIGS. 16A and 16B are diagrams presenting a baseline PPS Raw ByteSequence Payload (RBSP) syntax. Syntax for dealing with extensions inthe PPS are shown in FIG. 16B. Logic 1602 determines if the media is tobe coded/decoded including a first extension and reads the appropriatesignaling and data. Logic 1602 comprises statements 1606-1616. Statement1606 reads a pps_extensional_flag, which indicates whether the firstextension has been selected for the coding/decoding process. In oneembodiment, a logical value of “1” indicates that the media is to beprocessed using the first extension, and a logical value of “0”indicates that the media is not to be processed using the firstextension. Statement 1608 is a conditional statement that directsexecution of statements 1612-1614 depending upon the value of a(previously read) transform_skip_enabled_flag. In particular, theillustrated logic performs the operations shown in statements 1612-1614if the transform_skip_enabled_flag is a logical “1” or true.

Transform skipping is an extension that allows the DCT transform of a TUto be skipped under certain circumstances. Essentially, the DCTtransform has the property that for media with highly correlatedsignals, it results in outstanding energy compaction. However, for mediawith highly uncorrelated signals (e.g. media having a large amount ofdetail), the compaction performance is much less. For some media, theDCT transform process has so little compaction performance, the processis better skipped for better processing performance. Thetransform_skip_enabled_flag indicates when skipping the DCT transform ofa TU is permitted. This is described, for example, in “Early Terminationof Transform Skip Mode for High Efficiency Video Coding,” by Do KyungLee, Miso Park, Hyung-Do Kim and Je-Chang Jeong in the Proceedings ofthe 2014 International Conference on Communications, Signal Processingand Computers, which is hereby incorporated by reference. If thetransform_skip_enabled_flag is a logical 1 (true), processing is routedto statement 1612 and 1614. Otherwise, processing is routed to statement1618. Statement 1612 performs the operation of reading a value log2_transform_skip_max_size_minus2, which indicates the maximum TU sizethat may be skipped (if the transform_skip_enabled_flag indicates thatperforming the DCT transform of the TU is permitted). Statement 1614performs the operation of reading a flag pps_extension2_flag indicatingif a further extension (extension2) is implemented.

Next, logic 1604 is performed. Logic 1604 includes statements 1618-1622.Statement 1618 is a conditional statement that routes processing to thelogic of statements 1620 and 1622 if the pps_extension2_flag is alogical 1. Statements 1620 and 1622 read additionalpps_extension_data_flags while RBSP data exists.

In the foregoing PPS design of HEVC range extension, thepps_extension2_flag accounts for as yet unidentified extension data.According to the logic described above, if pps_extension1_flag is true,pps_extension2_flag is present. If pps_extension1_flag is not true,pps_extension2_flag is not present. If pps_extension2_flag is notpresent, pps_extension2_flag is inferred to be equal to 0. Ifpps_extension2_flag is 0, there is no additional extension data.

This logical formulation always checks the value of pps_extension2_flagfor possible additional extension syntax regardless of the status ofpps_extension1_flag. However, if pps_extension1_flag is 0, there is noneed to check pps_extension2_flag, because if pps_extension1_flag is 0,pps_extension2_flag will not be present, and if pps_extension2_flag isnot present, it will inferred to be equal to 0, which indicates thatthere is no further extension data.

FIG. 16C presents a modified PPS Raw Byte Sequence Payload (RBSP)syntax. Logic 1602′ is modified from logic 1602 and includes statements1606-1622. As before, statement 1606 implements logic reading thepps_extension1_flag. Statement 1608 is a conditional statement thatcommands the processing of logic associated with statements 1610-1622 ifthe pps_extension1_flag is a logical 1 or true, and otherwise skipsthese statements.

Statement 1610 is a conditional statement that commands the operationsof statements 1612-1614 be performed only if thetransform_skip_enabled_flag (described above) is a logical 1. Thosestatements include, as before, a statement to read the value of the log2_transform_skip_max_size_minus_2, and the pps_extension flag, as shownin statements 1612 and 1614. However, logic 1604 (statements 1616-1620)of FIG. 16B is now incorporated within the conditional statement 1608and is executed only if pps_extension1_flag tests to a logical 1. Thisallows the logic of statements 1610-1620 to be skipped ifpps_extension1_flag tests to a logical 0, thus saving execution time.While the foregoing is illustrated with respect to a second extension toread additional data that is only implicated if a first extensionrelated to transform skipping tests true, the first extension and secondextension may be any extensions that are non-independent (e.g. one ofthe extension functions or operations are only implicated depending onthe status of another of the extension functions or operations.

FIG. 16D is a flow chart illustrating exemplary operations for decodinga sequence comprising a plurality of pictures that are processed atleast in part according to a picture parameter set. In block 1630, afirst extension flag (for example, the pps_extension1_flag) that signalsa first extension function is to be performed in the processing of thesequence or the picture is read. In block 1632, a determination is madeas to whether the read first flag has a first value, and if the flagdoes not have a first value, processing is routed around the logic ofblocks 1634 and 1636. In the embodiment illustrated in FIG. 16C, this isanalogous to logic of statement 1608 and 1622. Only if the read firstflag has the first value, processing is passed to block 1634, whichreads a second extension flag that signals a second extension functionin the processing of the sequence or picture, and block 1636 performsthe second extension function according to the read second extensionflag. This is analogous to the logic of blocks 1614-1620.

In one embodiment, the first extension function is performed accordingto the first extension flag after reading the first extension flag andbefore reading the second extension flag. For example, with respect toFIG. 16C, the log 2_transform_skip_max_size_minus2 value is read if thepps_extension1_flag tests true before reading the pps_extension2_flag.IN this case, the processed picture comprises a plurality of TUs, andthe processing sequence comprises DCT transforming at least some of theTUs of the associated processed picture, and skipping the DCTtransforming process of other of the plurality of transform units undercertain circumstances, for example, if the TU is greater in size than amaximum TU size (e.g. 4×4). In this case, the first extension functioncomprises reading a value indicating the maximum permitted size of theTU for which DCT transforming may be skipped.

As described above, the first extension function and the secondextension function may be functionally related. For example, the secondextension function may require receiving a result of the first extensionfunction, before the second extension function may be completed. Or, thesecond extension function may be mutually exclusive from the firstextension function (e.g. either the first extension function or thesecond extension function are to be performed, but not both). Or, thesecond extension function may be a function that would not be performedunless the first extension function is also performed, hence the secondextension function is only implicated or performed in the processingsequence if the first extension function is also performed. For example,a computation may require an output or result from both the firstextension function and the second extension function, and hence,existence of the first extension function necessarily implicates thesecond extension function and vice-versa.

The foregoing operations are described with respect to a decodingprocess, which can take place in either a the source decoder 220 or anencoder 202, as a part of the encoding process. The encoding process mayalso be expressed as comprising determining if a slice of the one ormore slices is an inter-predicted slice according to slice type data,and if the slice is an inter-predicted slice, configuring a firstparameter in the slice header associated with the slice to a valuesignaling enablement of a state of weighted prediction of image dataassociated with the slice.

Hardware Environment

FIG. 17 illustrates an exemplary processing system 1700 that could beused to implement the embodiments of the invention. The computer 1702comprises a processor 1704 and a memory, such as random access memory(RAM) 1706. The computer 1702 is operatively coupled to a display 1722,which presents images such as windows to the user on a graphical userinterface 1718B. The computer 1702 may be coupled to other devices, suchas a keyboard 1714, a mouse device 1716, a printer, etc. Of course,those skilled in the art will recognize that any combination of theabove components, or any number of different components, peripherals,and other devices, may be used with the computer 1702.

Generally, the computer 1702 operates under control of an operatingsystem 1708 stored in the memory 1706, and interfaces with the user toaccept inputs and commands and to present results through a graphicaluser interface (GUI) module 1718A. Although the GUI module 1718A isdepicted as a separate module, the instructions performing the GUIfunctions can be resident or distributed in the operating system 1708,the computer program 1710, or implemented with special purpose memoryand processors. The computer 1702 also implements a compiler 1712 whichallows an application program 1710 written in a programming languagesuch as COBOL, C++, FORTRAN, or other language to be translated intoprocessor 1704 readable code. After completion, the application 1710accesses and manipulates data stored in the memory 1706 of the computer1702 using the relationships and logic that was generated using thecompiler 1712. The computer 1702 also optionally comprises an externalcommunication device such as a modem, satellite link, Ethernet card, orother device for communicating with other computers.

In one embodiment, instructions implementing the operating system 1708,the computer program 1710, and the compiler 1712 are tangibly embodiedin a computer-readable medium, e.g., data storage device 1720, whichcould include one or more fixed or removable data storage devices, suchas a zip drive, floppy disc drive 1724, hard drive, CD-ROM drive, tapedrive, etc. Further, the operating system 1708 and the computer program1710 are comprised of instructions which, when read and executed by thecomputer 1702, causes the computer 1702 to perform the steps necessaryto implement and/or use the invention. Computer program 1710 and/oroperating instructions may also be tangibly embodied in memory 1706and/or data communications devices 1730, thereby making a computerprogram product or article of manufacture. As such, the terms “articleof manufacture,” “program storage device” and “computer program product”as used herein are intended to encompass a computer program accessiblefrom any computer readable device or media.

The processing system 1700 may also be embodied in a desktop, laptop,tablet, notebook computer, personal data assistant (PDA), cellphone,smartphone, or any device with suitable processing and memorycapability. Further, the processing system 1700 may utilize specialpurpose hardware to perform some or all of the foregoing functionality.For example, the encoding and decoding processes described above may beperformed by a special purpose processor and associated memory.

Those skilled in the art will recognize many modifications may be madeto this configuration without departing from the scope of the presentdisclosure. For example, those skilled in the art will recognize thatany combination of the above components, or any number of differentcomponents, peripherals, and other devices, may be used. For example,particular functions described herein can be performed by hardwaremodules, or a processor executing instructions stored in the form ofsoftware or firmware. Further, the functionality described herein can becombined in single modules or expanded to be performed in multiplemodules.

CONCLUSION

The foregoing description of the preferred embodiment has been presentedfor the purposes of illustration and description. It is not intended tobe exhaustive or to limit the disclosure to the precise form disclosed.Many modifications and variations are possible in light of the aboveteaching. It is intended that the scope of rights be limited not by thisdetailed description, but rather by the claims appended hereto.

What is claimed is:
 1. A method of decoding a plurality of pictures,each picture processed at least in part according to a picture parameterset, the method comprising: (a) receiving a bitstream comprising theplurality of pictures and a picture parameter set; (b) for a pictureparsing the associated picture parameter set to determine for a picturein the plurality of pictures whether a pps extension present flagsignaling signaling flag specifies presence of a pps extension syntaxelement at a picture level for the picture and a pps extension syntaxstructure at said picture level for the picture, where said ppsextension syntax element includes a value of a plurality of bits; (c)wherein said pps extension present flag equal to 1 specifies that saidpps extension syntax element is present in said picture parameter set;(d) wherein said pps extension present flag equal to 0 specifies thatsaid pps extension syntax element is not present in said pictureparameter set; (e) for the picture the associated picture parameter setincludes said pps extension present flag, said pps extension syntaxstructure, and said pps extension syntax element, when present; (f)parsing said pps_extension syntax structure to determine if any ppsextension data flag syntax elements are present in the picture parameterset; (g) wherein said parsing said pps extension syntax structurefurther includes a syntax structure that includes a while(more_rbsp_data( )) structure; (h) wherein said pps extension syntaxstructure that includes said while (more_rbsp_data( )) structure furtherincludes said pps extension data flag; (i) wherein, when said ppsextension syntax element is equal to 0 then no said pps extension dataflag is present in said while (more_rbsp_data( )) structure.
 2. Themethod of claim 1 further comprising wherein, when said pps extensionsyntax element is not equal to zero then said pps extension data flag ispresent in said while (more_rbsp_data( )) structure.